The Average Complexity of Moore ’ s State Minimization Algorithm is O ( n log log n ) ⋆ Julien
نویسنده
چکیده
We prove that the average complexity, for the uniform distribution on complete deterministic automata, of Moore’s state minimization algorithm is O(n log log n), where n is the number of states in the input automata.
منابع مشابه
The Average Complexity of Moore's State Minimization Algorithm Is O(n log log n)
We prove that the average complexity, for the uniform distribution on complete deterministic automata, of Moore’s state minimization algorithm is O(n log log n), where n is the number of states in the input automata.
متن کاملAverage complexity of Moore's and Hopcroft's algorithms
In this paper we prove that for the uniform distribution on complete deterministic automata, the average time complexity of Moore’s state minimization algorithm is O(n log logn), where n is the number of states in the input automata and the number of letters in the alphabet is fixed. Then, an unusual family of implementations of Hopcroft’s algorithm is characterized, for which the algorithm wil...
متن کاملTRANSACTIONS ON COMPUTER - AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1 A Fast Algorithm for Area Minimization ofSlicing
| The traditional algorithm for area minimization of slicing oorplans due to Stockmeyer has time and space complexity O(n 2) in the worst case. For more than a decade, it has been considered the best possible. This paper presents a new algorithm of worst-case time and space complexity O(n log n), where n is the total number of realizations for the basic blocks, regardless whether the slicing is...
متن کاملA Parallel DFA Minimization Algorithm
In this paper, we have considered the state minimization problem for Deterministic Finite Automata (DFA). An efficient parallel algorithm for solving the problem on an arbitrary CRCW PRAM has been proposed. For n number of states and k number of inputs in Σ of the DFA to be minimized, the algorithm runs in O(kn log n) time and uses O( n log n ) processors.
متن کاملThe Number of Symbol Comparisons in QuickSort and QuickSelect
We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing the records to be processed. Our probabilistic models belong to a broad category of information sources that encompasses memoryless (i.e., independent-symbols) and Markov sources, as well as many unbounded-correlation sources....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009